//gcd and lcm; and how they would come to a magic multiple of the original two numbers.
gcd(x, y) = 2^min(j0,k0)*3^min(j1, k1)*5^min(j2, k2).

lcm(x, y) = 2^max(j0,k0)*3^max(j1, k1)*5^max(j2, k2).

Hence gcd(x, y) * lcm(x, y) = x * y;

  boolean primeNaive(int n){
    if (n < 2)
      return false;
    for(int i = 2; i < n; i++){
      if(n%i == 0) return false;
    }
    return true;
  }
  
  //Rule of independence:
  P(A and B) = P(A) * P(B); since event A and event B have nothing to do with each other.
  P(B given A) = P(B); since A indicates nothing about B.
  
  //Rule of Mutually exclusive:
  if A and B are mutually exclusive, then one happens also means that the other can not happen.
  P(A and B) = 0;
  !P(A or B) = P(A) + P(B) - P(A and B) = P(A) + P(B);
  
  